Geometric Complexity Theory IV: quantum group for the Kronecker problem
نویسندگان
چکیده
A fundamental problem in representation theory is to nd an explicit positive rule, akin to the Littlewood-Richardson rule, for decomposing the tensor product of two irreducible representations of the symmetric group (Kronecker problem). In this paper a generalization of the Drinfeld-Jimbo quantum group, with a compact real form, is constructed, and also an associated semisimple algebra that has conjecturally the same relationship with the generalized quantum group that the Hecke algebra has with the Drinfeld-Jimbo quantum group. In the sequel [24] it is observed that an explicit positive decomposition rule for the Kronecker problem exists assuming that the coordinate ring of the generalized quantum group has a basis analogous to the canonical basis for the coordinate ring of the Drinfeld-Jimbo quantum group, as per Kashiwara and Lusztig [12, 17], or in the dual setting{the associated algebra has a basis analogous to the Kazhdan-Lusztig basis for the Hecke algebra [13], as suggested by the experimental and theoretical results therein. In the other sequel [23], similar quantum group and algebra are constructed for the generalized plethysm problem, of which the Kronecker problem studied here is a special case. These problems play a central role in geometric complexity theory{ an approach to the P vs. NP and related problems. Visiting faculty member
منابع مشابه
Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem
A fundamental problem in representation theory is to find an explicit positive rule, akin to the Littlewood-Richardson rule, for decomposing the tensor product of two irreducible representations of the symmetric group (Kronecker problem). In this paper a generalization of the Drinfeld-Jimbo quantum group, with a compact real form, is constructed, and also an associated semisimple algebra that h...
متن کاملProject Summary: quantizing Schur functors
Geometric complexity theory (GCT) is an approach to P vs. NP and related problems in complexity theory using algebraic geometry and representation theory. A fundamental problem in representation theory, believed to be important for this approach, is the Kronecker problem, which asks for a positive combinatorial formula for the multiplicity gλμν of an irreducible representation Mν of the symmetr...
متن کاملMembership in Moment Polytopes is in NP and coNP
We show that the problem of deciding membership in the moment polytope associated with a finite-dimensional unitary representation of a compact, connected Lie group is in NP ∩ coNP. This is the first non-trivial result on the computational complexity of this problem, which naively amounts to a quadratically-constrained program. Our result applies in particular to the Kronecker polytopes, and th...
متن کاملReduced Kronecker Coefficients and Counter–examples to Mulmuley’s Strong Saturation Conjecture Sh with an Appendix by Ketan Mulmuley Emmanuel Briand, Rosa Orellana, and Mercedes Rosas
We provide counter–examples to Mulmuley’s strong saturation conjecture (strong SH) for the Kronecker coefficients. This conjecture was proposed in the setting of Geometric Complexity Theory to show that deciding whether or not a Kronecker coefficient is zero can be done in polynomial time. We also provide a short proof of the #P–hardness of computing the Kronecker coefficients. Both results rel...
متن کامل1 7 O ct 2 00 8 REDUCED KRONECKER COEFFICIENTS AND COUNTER – EXAMPLES TO MULMULEY ’ S SATURATION CONJECTURE
We provide counter–examples to Mulmuley’s SH conjecture for the Kronecker coefficients. This conjecture was proposed in the setting of Geometric Complexity Theory to show that deciding whether or not a Kronecker coefficient is zero can be done in polynomial time. We also provide a short proof of the #P–hardness of computing the Kronecker coefficients. Both results rely on the connections betwee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/cs/0703110 شماره
صفحات -
تاریخ انتشار 2007